package com.leetcode.LC;

public class LC122 {
    public int maxProfit(int[] prices) {

        int sum=0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i]>prices[i-1]){
                sum+=prices[i]-prices[i-1];
            }
        }
        return sum;
    }

    public static void main(String[] args) {
        System.out.println(new LC122().maxProfit(new int[]{7,6,4,3,1}));
    }
}
